SAT-based Model Checking and its applications to Train Control Systems
نویسنده
چکیده
Formal verification of railway control software has been identified to be one of the “grand challenges” [Jac04] of Computer Science. In this thesis, we demonstrate the successful application of various SAT-based model checking techniques to verify train control systems. Starting with a propositional model for a control system, more specifically an interlocking, we show how execution of the system can be modelled via a finite automaton. We give both bounded and unbounded algorithms to perform SAT-based model checking over such an automaton, commenting on the advantages and disadvantages of each. In order to tackle the state space explosion problem, we propose slicing. We then give the correctness of this method with respect to our modelling approach. The result of the thesis is a verification tool that combines the algorithms considered within the thesis. The tool has been applied to two real world interlocking systems and a discussion of the results is given.
منابع مشابه
Automatically Verifying Railway Interlockings using SAT-based Model Checking
In this paper, we demonstrate the successful application of various SATbased model checking techniques to verify train control systems. Starting with a propositional model for a control system, we show how execution of the system can be modelled via a finite automaton. We give algorithms to perform SAT-based model checking over such an automaton. In order to tackle state-space explosion we prop...
متن کاملEffects of track characteristics on dynamic responses of train-bridge systems
High speed trains are an indispensable part of rapid transportation systems in many countries. As the fastest means of transport on the ground, these trains are extremely sensitive to the terrain and track conditions. Geometrical irregularities and mechanical characteristics of the track, together with inconsistencies in the lane (including bridges that support the track) are considered importa...
متن کاملSymbolic Reachability Analysisbased on SAT -
The introduction of symbolic model checking using Binary Decision Diagrams (BDDs) has led to a substantial extension of the class of systems that can be algorithmically veriied. Although BDDs have played a crucial role in this success, they have some well-known drawbacks, such as requiring an externally supplied variable ordering and causing space blowups in certain applications. In a parallel ...
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملFUZZY TRAIN ENERGY CONSUMPTION MINIMIZATION MODEL AND ALGORITHM
Train energy saving problem investigates how to control train's velocity such that the quantity of energy consumption is minimized and some system constraints are satis ed. On the assumption that the train's weights on different links are estimated by fuzzy variables when making the train scheduling strategy, we study the fuzzy train energy saving problem. First, we propose a fuzzy energy ...
متن کامل